Polymorphic Names, Types, Constancy and Magic in a Type Secure Persistent Object Store
نویسندگان
چکیده
منابع مشابه
Safe Browsing in a Strongly Typed Persistent Environment
The need to examine data structures often occurs in programming language and database management systems. In this paper we describe how a browser for a strongly typed programming language ( PS-algol ) may be written in a type secure manner in a closed persistent environment. This is achieved without resorting to magic or having to break the type rules of the language by exploiting a compiler th...
متن کاملThe Theory of Classification Part 19: The Proliferation of Parameters
The Theory of Classification is an informal series of articles considering the formal notions of type and class in object-oriented languages. The series began by constructing models of objects, types, and inheritance, then branched out into interesting areas such as mixins, multiple inheritance and generic classes. Most recently, we returned to the core argument that simple types and subtyping ...
متن کاملTowards a Unified Model of Untyped Object Stores: Experience with the Tycoon Store Protocol
The Tycoon Store Protocol (TSP) specifies a clean interface between the frontend and the backend of fully integrated persistent environments. In contrast to high-level relational or object-oriented database languages, TSP is based on a low level, untyped, but highly flexible tagged store model that is particularly well-suited for the implementation of higher-order persistent polymorphic languag...
متن کاملPersistent object stores
The design and development of a type secure persistent object store is presented as part of an architecture to support experiments in concurrency, transactions and distribution. The persistence abstraction hides the physical properties of data from the programs that manipulate it. Consequently, a persistent object store is required to be of unbounded size, infinitely fast and totally reliable. ...
متن کاملWitnessing Purity, Constancy and Mutability
Restricting destructive update to values of a distinguished reference type prevents functions from being polymorphic in the mutability of their arguments. This restriction makes it easier to reason about program behaviour during transformation, but the lack of polymorphism reduces the expressiveness of the language. We present a System-F style core language that uses dependently kinded proof wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1987